A Distributed Algorithm for Minimum-Weight Spanning Trees
نویسندگان
چکیده
منابع مشابه
Summary of “A Distributed Algorithm for Minimum-Weight Spanning Trees”
This document summarizes the article published by Gallagerher et. al on “A Distributed Algorithm for Minimum-Weight Spanning Trees”. The asynchronous distributed algorithm determines a minimum-weight spanning tree for an undirected graph that has distinct finite weights for every edge.
متن کاملA distributed approximation algorithm for the minimum degree minimum weight spanning trees
Fischer [3] has shown how to compute a minimum weight spanning tree of degree at most b∆∗ + ⌈logb n⌉ in time O(n 4+1/ln ) for any constant b > 1, where ∆∗ is the value of an optimal solution and n is the number of nodes in the network. In this paper, we propose a distributed version of Fischer’s algorithm that requires messages and time complexity O(n ), and O(n) space per node.
متن کاملA Sub-Linear Time Distributed Algorithm for Minimum-Weight Spanning Trees
This paper considers the question of identifying the parameters governing the behavior of fundamental global network problems. Many papers on distributed network algorithms consider the task of optimizing the running time successful when an O(n) bound is achieved on an n-vertex network. We propose that a more sensitive parameter is the network’s diameter Diam. This is demonstrated in the paper ...
متن کاملCounting Minimum Weight Spanning Trees
We present an algorithm for counting the number of minimum weight spanning trees, based on the fact that the generating function for the number of spanning trees of a given graph, by weight, can be expressed as a simple determinant. For a graph with n vertices and m edges, our algorithm requires O(M(n)) elementary operations, whereM(n) is the number of elementary operations needed to multiply n...
متن کاملMinimum weight spanning trees with bounded diameter
Let G be a simple graph with non-negative edge weights. Determining a minimum weight spanning tree is a fundamental problem that arises in network design and as a subproblem in many combinatorial optimization problems such as vehicle routing. In some applications, it is necessary to restrict the diameter of the spanning tree and thus one is interested in the problem : Find, in a given weighted ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Programming Languages and Systems
سال: 1983
ISSN: 0164-0925,1558-4593
DOI: 10.1145/357195.357200